Non-scattered zero-dimensional remainders

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Finite dimensional scattered posets

We discuss a possible characterization, bymeans of forbidden configurations, of posets which are embeddable in a product of finitely many scattered chains. © 2013 Elsevier Ltd. All rights reserved. 0. Introduction and presentation of the results A fundamental result, due to Szpilrajn [33], states that every order on a set is the intersection of a family of linear orders on this set. The dimensi...

متن کامل

Nonhomogeneity of Remainders, Ii

We present an example of a separable metrizable topological group G having the property that no remainder of it is (topologically) homogeneous. 1. Introduction. All topological spaces under discussion are Tychonoff. A space X is homogeneous if for any two points x, y ∈ X there is a homeomorphism h from X onto itself such that h(x) = y. If bX is a com-pactification of a space X, then bX \ X is c...

متن کامل

Zero-dimensional proximities and zero-dimensional compactifications

Article history: Received 4 August 2008 Received in revised form 12 December 2008 Accepted 13 December 2008 MSC: 54E05 54D35 54G05

متن کامل

Scattered Data Interpolation in N-Dimensional Space

Radial Basis Functions (RBF) interpolation theory is briefly introduced at the “application level” including some basic principles and computational issues. The RBF interpolation is convenient for un-ordered data sets in n-dimensional space, in general. This approach is convenient especially for a higher dimension N 2 conversion to ordered data set, e.g. using tessellation, is computationally v...

متن کامل

Non-zero probability of nearest neighbor searching

Nearest Neighbor (NN) searching is a challenging problem in data management and has been widely studied in data mining, pattern recognition and computational geometry. The goal of NN searching is efficiently reporting the nearest data to a given object as a query. In most of the studies both the data and query are assumed to be precise, however, due to the real applications of NN searching, suc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Rocky Mountain Journal of Mathematics

سال: 1988

ISSN: 0035-7596

DOI: 10.1216/rmj-1988-18-3-635